Memory for retinotopic locations is more accurate than memory for spatiotopic locations, even when intending to reach.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Memory for retinotopic locations is more accurate than memory for spatiotopic locations, even for visually guided reaching.

To interact successfully with objects, we must maintain stable representations of their locations in the world. However, their images on the retina may be displaced several times per second by large, rapid eye movements. A number of studies have demonstrated that visual processing is heavily influenced by gaze-centered (retinotopic) information, including a recent finding that memory for an obj...

متن کامل

Retinotopic memory is more precise than spatiotopic memory.

Successful visually guided behavior requires information about spatiotopic (i.e., world-centered) locations, but how accurately is this information actually derived from initial retinotopic (i.e., eye-centered) visual input? We conducted a spatial working memory task in which subjects remembered a cued location in spatiotopic or retinotopic coordinates while making guided eye movements during t...

متن کامل

Spatial patterns and memory for locations.

Rats obtained food from the tops of vertical poles in a 5 x 5 matrix of locations. On each trial, the baited locations formed one of the two possible exemplars of a checkerboard spatial pattern. During training, locations that had been visited earlier in the trial were indicated by a visual cue. Following training, performance with and without the visual cues was compared. Spatial choices were ...

متن کامل

Precomputing Memory Locations for Parametric Allocations

Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduced by standard memory allocators. To overcome this problem, algorithms have been proposed that precompute static allocations for dynamically allocating programs with known numeric bounds on the number and sizes of allo...

متن کامل

Precomputing Memory Locations for Parametric Allocations1

Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduced by standard memory allocators. To overcome this problem, algorithms have been proposed that precompute static allocations for dynamically allocating programs with known numeric bounds on the number and sizes of allo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Vision

سال: 2017

ISSN: 1534-7362

DOI: 10.1167/17.10.1235